Two Algorithms for Valuated ∆-matroids
نویسنده
چکیده
Two algorithms are proposed for computing the maximum degree of a principal minor of specified order of a skew-symmetric rational function matrix. The algorithms are developed in the framework of valuated ∆matroid of Dress and Wenzel, and are valid also for valuated ∆-matroids in general.
منابع مشابه
On Circuit Valuation of Matroids 1
The concept of valuated matroids was introduced by Dress and Wenzel as a quantitative extension of the base exchange axiom for matroids. This paper gives several sets of cryptomorphically equivalent axioms of valuated matroids in terms of (R[f 1g)-valued vectors de ned on the circuits of the underlying matroid, where R is a totally ordered additive group. The dual of a valuated matroid is chara...
متن کاملMatroid Valuation on Independent Sets
Recently Dress andWenzel introduced the concept of valuated matroid in terms of a quantitative extension of the basis exchange axiom for matroids. This paper gives two sets of cryptomorphically equivalent axioms of valuated matroids in terms of a function defined on the family of the independent sets of the underlying matroid.
متن کاملOperations on M-Convex Functions on Jump Systems
A jump system is a set of integer points with an exchange property, which is a generalization of a matroid, a delta-matroid, and a base polyhedron of an integral polymatroid (or a submodular system). Recently, the concept of M-convex functions on constant-parity jump systems is introduced by Murota as a class of discrete convex functions that admit a local criterion for global minimality. M-con...
متن کاملOn Exchange Axioms for Valuated Matroids and Valuated Delta-Matroids
Two further equivalent axioms are given for valuations of a matroid. Let M = (V,B) be a matroid on a finite set V with the family of bases B. For ω : B → R the following three conditions are equivalent: (V1) ∀B,B′ ∈ B, ∀u ∈ B −B′,∃v ∈ B′ −B: ω(B) + ω(B′) ≤ ω(B − u+ v) + ω(B′ + u− v); (V2) ∀B,B′ ∈ B with B 6= B′, ∃u ∈ B −B′,∃v ∈ B′ −B: ω(B) + ω(B′) ≤ ω(B − u+ v) + ω(B′ + u− v); (V3) ∀B,B′ ∈ B, ∀...
متن کاملOptimal Matching Forests and Valuated Delta-Matroids
The matching forest problem in mixed graphs is a common generalization of the matching problem in undirected graphs and the branching problem in directed graphs. Giles presented an O(nm)-time algorithm for finding a maximum-weight matching forest, where n is the number of vertices and m is that of edges, and a linear system describing the matching forest polytope. Later, Schrijver proved total ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011